“gnparser”: a powerful parser for scientific names based on Parsing Expression Grammar

A Unification-Based Parser for Relational Grammar

We present an implemented unification-based parser for relational grammars developed within the s t ra t i f ied f ea tu re g r a m m a r (SFG) framework, which generalizes Kasper-Rounds logic to handle relational grammar analyses. We first introduce the key aspects of SFG and a lexicalized, graph-based variant of the framework suitable for implementing relational grammars. We then describe a h...

Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking

Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in terms of recognizing strings, rather than constructing them. It is, in fact, precise specification of a backtracking recursivedescent parser. Packrat parsing is a general method to handle backtracking in recursive-descent p...

A Feature-based Grammar for Korean Parsing

Experiments with a Powerful Parser

A Grammar Formalism and Parser for Linearization-based HPSG

Linearization-based HPSG theories are widely used for analyzing languages with relatively free constituent order. This paper introduces the Generalized ID/LP (GIDLP) grammar format, which supports a direct encoding of such theories, and discusses key aspects of a parser that makes use of the dominance, precedence, and linearization domain information explicitly encoded in this grammar format. W...